Se p 20 09 The energy of random graphs ∗
نویسندگان
چکیده
In 1970s, Gutman introduced the concept of the energy E (G) for a simple graph G, which is defined as the sum of the absolute values of the eigenvalues of G. This graph invariant has attracted much attention, and many lower and upper bounds have been established for some classes of graphs among which bipartite graphs are of particular interest. But there are only a few graphs attaining the equalities of those bounds. We however obtain an exact estimate of the energy for almost all graphs by Wigner’s semi-circle law, which generalizes a result of Nikiforov. We further investigate the energy of random multipartite graphs by considering a generalization of Wigner matrix, and obtain some estimates of the energy for random multipartite graphs.
منابع مشابه
Se p 20 09 There are only finitely many distance - regular graphs of fixed valency greater than two
There are only finitely many distance-regular graphs of fixed valency greater than two Abstract In this paper we prove the Bannai-Ito conjecture, namely that there are only finitely many distance-regular graphs of fixed valency greater than two.
متن کاملar X iv : h ep - p h / 03 09 18 4 v 1 1 6 Se p 20 03 Origin of universes with different properties
The concept of a random Lagrangian is proposed. It is considered as a basis for a new view of the old problems such as renormalization, nonzero vacuum energy and the anthropic principle. It gives rise to nontrivial consequences both in cosmology and in particle physics. It is shown that some of them could be checked in the nearest future. Scalar-tensor models of gravity are a direct and necessa...
متن کاملSe p 20 09 On finite edge - primitive and edge - quasiprimitive graphs ∗
Many famous graphs are edge-primitive, for example, the Heawood graph, the Tutte–Coxeter graph and the Higman–Sims graph. In this paper we systematically analyse edge-primitive and edge-quasiprimitive graphs via the O’Nan–Scott Theorem to determine the possible edge and vertex actions of such graphs. Many interesting examples are given and we also determine all G-edge-primitive graphs for G an ...
متن کاملar X iv : h ep - p h / 05 09 28 6 v 1 2 6 Se p 20 05 Random Matrices
We review elementary properties of random matrices and discuss widely used mathematical methods for both hermitian and nonhermitian random matrix ensembles. Applications to a wide range of physics problems are summarized.
متن کاملEnumerating labeled graphs with a k-cycle
Cayley’s Tree Formula for enumerating labeled trees is well known. In this paper a more general result is presented for graphs with exactly one k-cycle (i.e. cycle on k vertices ).It is proved that for all integers n and k such that (n ≥ k ≥ 3), the number of possible labeled graphs on n vertices that contain exactly one k-cycle is ( n−1 k−1 ) nn−k. 1 ar X iv :0 90 9. 24 00 v1 [ m at h. C O ] 1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009